Minimal indices and minimal bases via filtrations
نویسنده
چکیده
In this note we develop a new way of formulating the notions of minimal basis and minimal indices, based on the concept of a filtration of a vector space. The goal is to provide useful new tools for working with these important concepts, as well as to gain deeper insight into their fundamental nature. This approach also readily reveals a strong minimality property of minimal indices, from which follows a characterization of the vector polynomial bases in rational vector spaces. The effectiveness of this new formulation is further illustrated by proving two fundamental properties: the invariance of the minimal indices of a matrix polynomial under field extension, and the direct sum property of minimal indices.
منابع مشابه
Ela Linearizations of Singular Matrix Polynomials and the Recovery of Minimal Indices∗
A standard way of dealing with a regular matrix polynomial P (λ) is to convert it into an equivalent matrix pencil – a process known as linearization. Two vector spaces of pencils L1(P ) and L2(P ) that generalize the first and second companion forms have recently been introduced by Mackey, Mackey, Mehl and Mehrmann. Almost all of these pencils are linearizations for P (λ) when P is regular. Th...
متن کاملExtermal trees with respect to some versions of Zagreb indices via majorization
The aim of this paper is using the majorization technique to identify the classes of trees with extermal (minimal or maximal) value of some topological indices, among all trees of order n ≥ 12
متن کاملمطالعه نیمهکلاسیکی چند رابطه جابهجاگری تعمیمیافته
Our aim in this paper is to find the observable effects of the generalized commutators. For this purpose we investigate two problems in quantum mechanics with minimal length procedure. Firstly, we study hydrogen atom energy levels via minimal length uncertainty relation algebra. From comparing our results, with experimental data we estimate an upper limit for minimal length. Secondly, we inve...
متن کاملFiedler Companion Linearizations and the Recovery of Minimal Indices
A standard way of dealing with a matrix polynomial P (λ) is to convert it into an equivalent matrix pencil – a process known as linearization. For any regular matrix polynomial, a new family of linearizations generalizing the classical first and second Frobenius companion forms has recently been introduced by Antoniou and Vologiannidis, extending some linearizations previously defined by Fiedle...
متن کاملRecovery of Eigenvectors and Minimal Bases of Matrix Polynomials from Generalized Fiedler Linearizations
A standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynomial P (λ) into a matrix pencil that preserves its elementary divisors and, therefore, its eigenvalues. This process is known as linearization and is not unique, since there are infinitely many linearizations with widely varying properties associated with P (λ). This freedom has motivated the recent...
متن کامل